Reverse mathematics and the equivalence of definitions for well and better quasi-orders
نویسندگان
چکیده
In reverse mathematics, one formalizes theorems of ordinary mathematics in second order arithmetic and attempts to discover which set theoretic axioms are required to prove these theorems. Often, this project involves making choices between classically equivalent definitions for the relevant mathematical concepts. In this paper, we consider a number of equivalent definitions for the notions of well quasi-order and better quasi-order and examine how difficult it is to prove the equivalences of these definitions. As usual in reverse mathematics, we work in the context of subsystems of second order arithmetic and take RCA0 as our base system. RCA0 is the subsystem formed by restricting the comprehension scheme in second order arithmetic to ∆1 formulas and adding a formula induction scheme for Σ1 formulas. For the purposes of this paper, we will be concerned with fairly weak extensions of RCA0 (indeed strictly weaker than the subsystem ACA0 which is formed by extending the comprehension scheme in RCA0 to cover all arithmetic formulas) obtained by adjoining certain combinatorial principles to RCA0. Among these, the most widely used in reverse mathematics is Weak König’s Lemma; the resulting theory WKL0 is extensively documented in [11] and elsewhere. We give three other combinatorial principles which we use in this paper. In these principles, we use k to denote not only a natural number but also the finite set {0, . . . , k − 1}. For any
منابع مشابه
Infinite Saturated Orders
We generalize the notion of saturated orders to infinite partial orders and give both a set-theoretic and an algebraic characterization of such orders. We then study the proof theoretic strength of the equivalence of these characterizations in the context of reverse mathematics, showing that depending on one’s choice of definitions, this equivalence is either provable in RCA0 or equivalent to A...
متن کاملInterval Orders and Reverse Mathematics
We study the reverse mathematics of interval orders. We establish the logical strength of the implications between various definitions of the notion of interval order. We also consider the strength of different versions of the characterization theorem for interval orders: a partial order is an interval order if and only if it does not contain 2 ⊕ 2. We also study proper interval orders and thei...
متن کاملTopological structure on generalized approximation space related to n-arry relation
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
متن کاملEquivalence of K-functionals and modulus of smoothness for fourier transform
In Hilbert space L2(Rn), we prove the equivalence between the mod-ulus of smoothness and the K-functionals constructed by the Sobolev space cor-responding to the Fourier transform. For this purpose, Using a spherical meanoperator.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 69 شماره
صفحات -
تاریخ انتشار 2004